Approximation theory - PDFSEARCH.IO - Document Search Engine

Approximation theory
Results: 831

#	Item
81	CS264: Beyond Worst-Case Analysis Lecture #6: Clustering in Approximation-Stable Instances∗ Tim Roughgarden† October 10, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-06 18:13:07 Statistics Computational statistics Data analysis Cluster analysis Data mining Geostatistics K-means clustering K-medians clustering Approximation algorithm Median Data stream clustering Single-linkage clustering
82	CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-14 09:53:16 Computational complexity theory Operations research Theory of computation Mathematics Knapsack problem Optimization problem NP Mathematical optimization Polynomial-time approximation scheme Dynamic programming Time complexity Isolation lemma
83	The Maximum Hypervolume Set Yields Near-optimal Approximation Karl Bringmann Tobias Friedrich Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:08 Computational complexity theory Mathematical optimization Multi-objective optimization Base Approximation algorithms Mathematics
84	ALGO 2010 ATMOS/WAOA schedule THURSDAY 9 Sept:30 - 9:00 9:00 - 9:50 10::20 Add to Reading List Source URL: algo2010.csc.liv.ac.uk Language: English - Date: 2010-09-01 10:39:54 Operations research Approximation algorithm Computational complexity theory WAOA-FM Mathematical optimization Bin packing problem Mathematics Applied mathematics
85	Combinatorial Auctions with Restricted Complements Ittai Abraham Microsoft Research, Silicon Valley Moshe Babaioff Microsoft Research, Silicon Valley Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2012-04-26 10:21:18 Graph theory Mathematics Mechanism design Game theory Auctions Hypergraph Valuation VickreyClarkeGroves auction VickreyClarkeGroves mechanism Approximation algorithm Treewidth Optimization problem
86	Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Add to Reading List Source URL: stefan.buettcher.org Language: English - Date: 2004-09-19 21:38:52 Computational complexity theory Theory of computation Mathematics NP-complete problems Set cover problem NP Dominating set Approximation algorithm Metric k-center Optimization problem Reduction P versus NP problem
87	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:56 Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP
88	Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Marina Papatriantafilou Happier times in Iceland, Add to Reading List Source URL: www.cse.chalmers.se Language: English - Date: 2011-05-18 09:51:33 Mathematics Discrete mathematics Matching Combinatorics Cooperative games Game theory Combinatorial optimization Preference Stable marriage problem
89	NONLINEAR WAVELET APPROXIMATION IN ANISOTROPIC BESOV SPACES Christopher Leisner Dartmouth College Abstract. We introduce new anisotropic wavelet decompositions associated with Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2001-06-28 05:54:16 Mathematical analysis Mathematics Operator theory Differential forms Approximation theory Besov space Modulus of smoothness Closed and exact differential forms Constructible universe Differential forms on a Riemann surface Modulus of continuity
90	Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann1 and Tobias Friedrich2,3 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:42 Computational complexity theory Theory of computation Complexity classes Polynomial-time approximation scheme BPP Time complexity NP NC

UPDATE